Incremental computation of planar maps
نویسندگان
چکیده
منابع مشابه
Incremental Compact 3D Maps of Planar Patches from RGBD Points
The RGBD sensors have opened the door to low cost perception capabilities for robots and to new approaches on the classic problems of self localization and environment mapping. The raw data coming from these sensors are typically huge clouds of 3D colored points, which are heavy to manage. This paper describes a premilinary work on an algorithm that incrementally builds compact and dense 3D map...
متن کاملIncremental and batch planar simplification of dense point cloud maps
Dense RGB-D SLAM techniques and high-fidelity LIDAR scanners are examples from an abundant set of systems capable of providing multi-million point datasets. These datasets quickly become difficult to process due to the sheer volume of data, typically containing significant redundant information, such as the representation of planar surfaces with millions of points. In order to exploit the richn...
متن کاملEecient Computation via Incremental Computation
Incremental computation takes advantage of repeated computations on inputs that diier slightly from one another, computing each output eeciently by exploiting the previous output. This paper gives an overview of a general and systematic approach to incrementalization. Given a program f and an operation , the approach yields an incremental program that computes f (x y) eeciently by using the res...
متن کاملFully Incremental LCS Computation
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similarities between biological sequences. A common scheme for sequence comparison is the longest common subsequence (LCS ) metric. This paper considers the fully incremental LCS computation problem as follows: For any strings A,...
متن کاملE cient Computation via Incremental Computation
Incremental computation takes advantage of repeated computations on inputs that di er slightly from one another, computing each output e ciently by exploiting the previous output. This paper gives an overview of a general and systematic approach to incrementalization. Given a program f and an operation , the approach yields an incremental program that computes f(x y) e ciently by using the resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGGRAPH Computer Graphics
سال: 1989
ISSN: 0097-8930
DOI: 10.1145/74334.74369